Introducing Dialectical Bases in Defeasible Argumentation
نویسندگان
چکیده
Defeasible argumentation is a form of defeasible reasoning, that emphasizes the notion of an argument. An argument A for a conclusion q is a tentative piece of reasoning which supports q. In an argumentative framework, common sense reasoning can be modeled as a process in which we must determine whether an argument justifies its conclusion. The process mentioned above takes considerable computational effort. For this reason it would be convenient to keep a repository of already computed justifications to save work already done with previously solved queries. In this paper we introduce the concept of dialectical bases as a first step in direction to defining a justification maintenance system for argumentative frameworks.
منابع مشابه
Generating Defeasible Knowledge Bases from Real-World Argumentations using D-BAS
d-bas is an open-source web tool for dialog-based online argumentation among non-expert human users [7]. In this work, we present dabasco, a d-bas module that allows to automatically export d-bas discussions, interpreted as defeasible knowledge bases, into formats of three well-established argumentation models: abstract Argumentation Frameworks, the ASPIC Framework, and Abstract Dialectical Fra...
متن کاملInstantiating Knowledge Bases in Abstract Dialectical Frameworks
We present a translation from defeasible theory bases to abstract dialectical frameworks, a recent generalisation of abstract argumentation frameworks. Using several problematic examples from the literature, we first show how our translation addresses important issues of existing approaches. We then prove that the translated frameworks satisfy the rationality postulates closure and direct/indir...
متن کاملPruning Search Space in Defeasible Argumentation
Defeasible argumentation has experienced a considerable growth in AI in the last decade. Theoretical results have been combined with development of practical applications in AI & Law, CaseBased Reasoning and various knowledge-based systems. However, the dialectical process associated with inference is computationally expensive. This paper focuses on speeding up this inference process by pruning...
متن کاملA Formalization of Dialectical Bases for Defeasible Logic Programming
Defeasible argumentation is a form of defeasible reasoning that emphasizes the notion of arguments. An argument A for a conclusion q is a tentative piece of reasoning which supports q. In an argumentative framework, common-sense reasoning can be modeled as a process in which we must determine whether an argument justifies its conclusion. Defeasible logic programming (DeLP) is an extension of th...
متن کاملDialectical Explanations in Defeasible Argumentation
This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undeveloped field in the area. Therefore, we move in this direction by defining a concrete argument system with explanation facilities. We consider the structures that provide information on the warrant status of a literal. Our focus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999